BTH: an efficient parsing algorithm for word-spotting
نویسندگان
چکیده
This paper presents a new parsing algorithm, BTH, which is capable of efficiently parsing a keyword lattice that contains a large number of false alarms. The BTH parser runs without unfolding the given keyword lattice, and thus it can efficiently obtain a set of word sequences acceptable to the given grammar as the parser result. The algorithm has been implemented on Windows-based PCs and is tested by applying it to a car navigation task that has a scale of practical applications. The result indicates promise in implementing the function of a sentence utterance-based spontaneous speech understanding in next -generation car navigation systems.
منابع مشابه
Document Image Retrieval Based on Keyword Spotting Using Relevance Feedback
Keyword Spotting is a well-known method in document image retrieval. In this method, Search in document images is based on query word image. In this Paper, an approach for document image retrieval based on keyword spotting has been proposed. In proposed method, a framework using relevance feedback is presented. Relevance feedback, an interactive and efficient method is used in this paper to imp...
متن کاملTitle Consideration on Syntactic Analyses for a Speech
SUMMARY In this paper, we compared the left-to-right & top-down parsing strategy with the island-driven & botom-up strategy by using a simulated phoneme recognizer. The both strategies adopted the beam search. The syntactic constraints were represented by a context-free grammar. The word lattice for an utterrance was generated by a word spotting algorithm from an ambiguous phoneme sequence. The...
متن کاملThe syntax-oriented speech understanding system - SPOJUS-SYNO
This paper describes a syntax oriented spoken japanese understanding system named "SPOJUS-SYNO". At first, this system makes word HMMs automatical!y by concatenating syl!able-based (trained) HMMs. Then a word lattice is hypothesized by using a word spotting algorithm and word-based HMMs. Final!y, the timesynchronous left-to-right parsing algorithm is executed to find the best word sequence from...
متن کاملRadial Line Fourier Descriptor for Segmentation-free Handwritten Word Spotting
Automatic recognition of historical handwritten manuscripts is a daunting task due to paper degradation over time. Recognition-free retrieval or word spotting is popularly used for information retrieval and digitization of the historical handwritten documents. However, the performance of word spotting algorithms depends heavily on feature detection and representation methods. Although there exi...
متن کاملAn improved joint model: POS tagging and dependency parsing
Dependency parsing is a way of syntactic parsing and a natural language that automatically analyzes the dependency structure of sentences, and the input for each sentence creates a dependency graph. Part-Of-Speech (POS) tagging is a prerequisite for dependency parsing. Generally, dependency parsers do the POS tagging task along with dependency parsing in a pipeline mode. Unfortunately, in pipel...
متن کامل